00_cover_page

01_graph_optimization_building_mi

02_the_core_problem_connect_every

03_real_world_applications

04_graph_theory_refresher

05_what_is_a_spanning_tree

06_defining_the_minimum_spanning_

07_fundamental_properties_of_msts

08_the_greedy_strategy

09_the_cut_property_why_greedy_wo

10_introducing_prim_s_algorithm

11_analogy_the_expanding_frontier

12_prim_s_algorithm_walkthrough_i

13_prim_s_algorithm_walkthrough_t

14_prim_s_algorithm_walkthrough_u

15_prim_s_algorithm_walkthrough_t

16_interactive_quiz_which_edge_is

17_implementing_prim_s_required_d

18_implementation_1_adjacency_mat

19_when_is_o_v_2_good_dense_graph

20_finding_the_minimum_faster_the

21_implementation_2_adjacency_lis

22_when_is_o_e_log_v_better_spars

23_complexity_showdown_v_2_vs_e_l

24_application_designing_a_campus

25_application_image_segmentation

26_common_pitfall_disconnected_gr

27_common_pitfall_managing_the_vi

28_debugging_challenge_find_the_b

29_a_glimpse_of_kruskal_s_algorit

30_kruskal_s_helper_the_disjoint_

31_prim_s_vs_kruskal_s_a_quick_co

Your Personal AI Tutor

Ask me anything! Here are some ideas to get started:

Understand Concepts

Ask me to explain the current slide or a concept in simple terms.

"Explain recursion in simple terms." "What is a `Class`?"

Generate Code

Request code examples in different programming languages.

"Binary search example in Python" "How to implement adjacency list in C"

Use Your Tone and Language

Ask in different languages or tones and I'll adapt.

"What does acyclic mean" "呢張slide入面個符號g代表咩" "这里`Heap`的中文是什么"

The AI assistant can make mistakes, verify important info.